An Iterative Approach for the Solution of the Constrained OWA Aggregation Problem with Two Comonotone Constraints

In this paper, first, we extend the analytical expression of optimal solution constrained OWA aggregation problem with two comonotone constraints by also including case when weights are arbitrary non-negative numbers. Then, indicate an iterative algorithm that precisely indicates whether a constraint in auxiliary is either biding or strictly redundant. Actually, (or constraints, as may occur) essential expressing initial problem.